منابع مشابه
Nathalie Lazaric
The aim of this article is to understand permanence and changes inside organizational routines. For this purpose, it seems important to explain how individual and collective memorisation occurs, so as to grasp how knowledge can be converted into routines. Although memorisation mechanisms imply a degree of durability, our procedural and declarative knowledge, and our memorisation processes, evol...
متن کاملVitae for Nathalie Revol
Nathalie REVOL Research scientist at INRIA Birth date: 04-12-1967 3 children (born in 2005 and 2008) Citizenship: french Address: INRIA, AriC team LIP, Université de Lyon École Normale Supérieure de Lyon 46, allée d’Italie 69364 Lyon Cedex 07, France Phone number: (33) 4-37-28-74-76 Fax: (33) 4-72-72-80-80 E-mail: [email protected] Web page: http://perso.ens-lyon.fr/nathalie.revol/ Las...
متن کاملBertrand competition
Bertrand competition is a model of competition used in economics, named after Joseph Louis François Bertrand (1822-1900). Specifically, it is a model of price competition between duopoly firms which results in each charging the price that would be charged under perfect competition, known as marginal cost pricing. The model has the following assumptions: There are at least two firms producing ho...
متن کاملBertrand Supertraps
We study oligopoly price competition between multiproduct firms, firms whose products interact in the profit function. Specifically, we focus on the impact of intra-firm product interactions on the level of equilibrium profits. This impact is divided into two effects: a direct effect and a strategic effect (i.e., through the competitors’ actions). We derive conditions such that the strategic ef...
متن کاملChristel Baier , Nathalie Bertrand , Patricia Bouyer and Thomas Brihaye When are Timed Automata Determinizable ? Research Report LSV - 09 - 08 14 April 2009
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boundedness condition, the infinite timed tree can be reduced into a classical deterministic timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studi Francesi
سال: 2023
ISSN: ['2421-5856', '0039-2944']
DOI: https://doi.org/10.4000/studifrancesi.53403